A Fast Evolutionary Algorithm in Codebook Design
نویسندگان
چکیده
This paper presents a fast algorithm to find an optimal subset codebook from a super codebook in a way that the RMS error between the new codebook and the training set in vector quantization becomes minimum. To have a fast algorithm, a genetic based algorithm is used that uses 2 evolutions, one in designing the whole sub-codebook and the other in finding each individual codeword of the sub-codebook. This optimal codebook can be efficiently used in the real time compression of the images with PSNR improvement of about 1.1 – 8.2db in blocks of the image. Key-Words: Vector Quantization, Image Compression, Adaptive VQ, Codebook Design, Genetic Algorithm
منابع مشابه
Bacterial Foraging Particle Swarm Optimization Algorithm Based Fuzzy-VQ Compression Systems
This study proposes a novel bacterial foraging swarm-based intelligent algorithm called the bacterial foraging particle swarm optimization (BFPSO) algorithm to design vector quantization (VQ)-based fuzzy-image compression systems. It improves compressed image quality when processing many image patterns. The BFPSO algorithm is an efficient evolutionary learning algorithm that manages complex glo...
متن کاملMulti-layer Clustering Topology Design in Densely Deployed Wireless Sensor Network using Evolutionary Algorithms
Due to the resource constraint and dynamic parameters, reducing energy consumption became the most important issues of wireless sensor networks topology design. All proposed hierarchy methods cluster a WSN in different cluster layers in one step of evolutionary algorithm usage with complicated parameters which may lead to reducing efficiency and performance. In fact, in WSNs topology, increasin...
متن کاملFast algorithm for VQ codebook design - Communications, Speech and Vision, IEE Proceedings I
The paper presents a fast codebook training algorithm for vector quantisation. It uses an elimination rule, based on triangular inequality criteria, as well as the partial distortion elimination method, to relieve the computational burden of a conventional codebook training algorithm, including a binary codeword splitting algorithm for the initial codebook and the LBG recursive algorithm. Over ...
متن کاملA High-Speed Codebook Design Algorithm for ECVQ Using Angular Constraint with Search Space Partitioning
In this paper, we propose a fast codebook generation algorithm for entropy-constrained vector quantization (ECVQ). The algorithm uses the angular constraint and employs a suitable hyperplane to partition the codebook and image data in order to reduce the search area and accelerate the search process in the codebook design. This algorithm allows significant acceleration in codebook design proces...
متن کاملFast Codebook Design for Vector Quantization on Partitioned Space
Vector quantization(VQ) is an attractive technique for lossy data compression, which has been a key technology for data storage and/or transfer. So far, various competitive learning (CL) algorithms have been proposed to design optimal codebooks presenting quantization with minimized errors. However, their practical use has been limited for large scale problems, due to the computational complexi...
متن کامل